A probabilistic plan recognition algorithm based on plan tree grammars
نویسندگان
چکیده
منابع مشابه
A probabilistic plan recognition algorithm based on plan tree grammars
We present the PHATT algorithm for plan recognition. Unlike previous approaches to plan recognition, PHATT is based on a model of plan execution. We show that this clarifies several difficult issues in plan recognition including the execution of multiple interleaved root goals, partially ordered plans, and failing to observe actions. We present the PHATT algorithm’s theoretical basis, and an im...
متن کاملProbabilistic Grammars for Plan Recognition
thenis Teneketzis for their many comments and suggestions on this dissertation. Thanks also to all of the members of the Decision Machine Group for all of their feedback at various stages of the research. Thanks to my various ooce-mates over the years for not overly straining our limited computing resources, and special thanks to Daniel Berwick for providing his stereo system to enhance the res...
متن کاملProbabilistic State-Dependent Grammars for Plan Recognition
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represent an agent’s plan-generation process. The PSDG language model extends probabilistic contextfree grammars (PCFGs) by allowing production probabilities to depend on an explicit model of the planning agent’s internal and ...
متن کاملA New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yappr). Yappr is based on weighted model counting, building its models using string rewriting rather than tree adjunction or other tree building methods used in previous work. Since model construction is often the most com...
متن کاملLandmark-Based Plan Recognition
Recognition of goals and plans using incomplete evidence from action execution can be done efficiently by using planning techniques. In many applications it is important to recognize goals and plans not only accurately, but also quickly. In this paper, we develop a heuristic approach for recognizing plans based on planning techniques that rely on ordering constraints to filter candidate goals f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2009
ISSN: 0004-3702
DOI: 10.1016/j.artint.2009.01.003